On Asymmetric Distances
نویسندگان
چکیده
منابع مشابه
On asymmetric distances
In this paper we discuss asymmetric length structures and asymmetric metric spaces. A length structure induces a (semi)distance function; by using the total variation formula, a (semi)distance function induces a length. In the first part we identify a topology in the set of paths that best describes when the above operations are idempotent. As a typical application, we consider the length of pa...
متن کاملAsymmetric Mu - Pair Photoproduction and Quantum Elextpodynamics at Small Distances
'A sensitive test of the theory of quantum electrodynamics as applied to muons is analyzed in this paper. The test consists of photoproducing mu-pa.irs in hydrogen such that the negative muon is produced at small angles with respect to the incident photon and with nearly all of the available energy. The positive muon and the recoil proton are not detected. The cross section is calculated from t...
متن کاملOn the Blocks of Interpoint Distances
We study the blocks of interpoint distances, their distributions, correlations, independence and the homogeneity of their total variances. We discuss the exact and asymptotic distribution of the interpoint distances and their average under three models and provide connections between the correlation of interpoint distances with their vector correlation and test of sphericity. We discuss testing...
متن کاملThe supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances
Recently, E.A. Emerson and C.S. Jutla (SIAM J. Comput., 1999), have successfully applied complexity of tree automata to obtain optimal deterministic exponential time algorithms for some important modal logics of programs. The running time of these algorithms corresponds, of course, to complexity functions which are potential functions and, thus, they do not belong, in general, to any dual p-com...
متن کاملDistances on Lozenge Tilings
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower bound for the flipdistance (i.e. the number of necessary local transformations involving three lozenges) between two given tilings. It is here proven that, for n ≤ 4, the flip-distance between two tilings is equal to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis and Geometry in Metric Spaces
سال: 2013
ISSN: 2299-3274
DOI: 10.2478/agms-2013-0004